Imaginary automorphisms on real hyperelliptic curves
نویسندگان
چکیده
A real hyperelliptic curve X is said to be Gaussian if there is an automorphism α : XC → XC such that α = [−1]C ◦ α, where [−1] denotes the hyperelliptic involution on X. Gaussian curves arise naturally in several contexts, for example when one studies real Jacobians. In the present paper we study the properties of Gaussian curves and we describe their moduli spaces. MSC 2000: 14H15, 14H37, 14P99, 30F50
منابع مشابه
Efficient Divisor Arithmetic on Real Hyperelliptic Curves
In 1989, Koblitz [3] first proposed the Jacobian of a conventional (imaginary) hyperelliptic curve for use in public-key cryptographic protocols. Hyperelliptic curves are in a sense generalizations of elliptic curves. The Jacobian is a finite abelian group which, like elliptic curve groups, has unique representatives of group elements and efficient arithmetic (divisor addition and reduction). A...
متن کاملExplicit Formulas for Real Hyperelliptic Curves of Genus 2 in Affine Representation
In this paper, we present for the first time efficient explicit formulas for arithmetic in the degree 0 divisor class group of a real hyperelliptic curve. Hereby, we consider real hyperelliptic curves of genus 2 given in affine coordinates for which the underlying finite field has characteristic > 3. These formulas are much faster than the optimized generic algorithms for real hyperelliptic cur...
متن کاملFaster Cryptographic Key Exchange on Hyperelliptic Curves
We present a new approach to key exchange based on divisor arithmetic for the real model of a hyperelliptic curve over a finite field, as opposed to the imaginary representation that is normally used for cryptographic applications. Using generic divisor arithmetic, our protocol is almost fifteen percent faster than conventional key exchange using hyperelliptic curves, with the most significant ...
متن کاملCryptographic protocols on real hyperelliptic curves
We present public-key cryptographic protocols for key exchange, digital signatures, and encryption whose security is based on the presumed intractability of solving the principal ideal problem, or equivalently, the distance problem, in the real model of a hyperelliptic curve. Our protocols represent a significant improvement over existing protocols using real hyperelliptic curves. Theoretical a...
متن کاملFixed points of automorphisms of real algebraic curves
We bound the number of fixed points of an automorphism of a real curve in terms of the genus and the number of connected components of the real part of the curve. Using this bound, we derive some consequences concerning the maximum order of an automorphism and the maximum order of an abelian group of automorphisms of a real curve. We also bound the full group of automorphisms of a real hyperell...
متن کامل